Efficient Processing of Underspecified Discourse Representations

نویسندگان

  • Michaela Regneri
  • Markus Egg
  • Alexander Koller
چکیده

Underspecification-based algorithms for processing partially disambiguated discourse structure must cope with extremely high numbers of readings. Based on previous work on dominance graphs and weighted tree grammars, we provide the first possibility for computing an underspecified discourse description and a best discourse representation efficiently enough to process even the longest discourses in the RST Discourse Treebank.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Notion of Semantic Coherence for Underspecified Semantic Representation

The general problem of finding satisfying solutions to constraint-based underspecified representations of quantifier scope is NP-complete. Existing frameworks, including Dominance Graphs, Minimal Recursion Semantics, and Hole Semantics, have struggled to balance expressivity and tractability, in order to cover real natural language sentences with efficient algorithms. We address this trade-off ...

متن کامل

On Interpreting F-Structures as UDRSs

We describe a method for interpreting abstract fiat syntactic representations, LFG f-structures, as underspecified semantic representations , here Underspecified Discourse Representation Structures (UDRSs). The method establishes a one-to-one correspondence between subsets of the LFG and UDRS formalisms. It provides a model theoretic interpretation and an inferen-tial component which operates d...

متن کامل

Disambiguation as (Defeasible) Reasoning about Underspecified Representations

UNDERSPECIFIED REPRESENTATIONS have been proposed as a way of formalizing sentence disambiguation in terms of (usually, nonmonotonic) reasoning. But in fact the existing theories about the semantics of underspecified representations either fail to capture our intuitions about ambiguity, or lead one to believe that the kind of inferences used in disambiguation have nothing to do with what we usu...

متن کامل

"What you encode is not necessarily what you store": evidence for sparse feature representations from mismatch negativity.

The present study examines whether vowels embedded in complex stimuli may possess underspecified representations in the mental lexicon. The second goal was to assess the possible interference of the lexical status of stimuli under study. Minimal pairs of German nouns differing only in the stressed vowels [e], [ø], and [o], and derived pseudowords, were used to measure the Mismatch Negativity (M...

متن کامل

Semantic Underspecification : Which Technique for What

In recent years a variety of representation formalisms have been proposed that support the construction of underspecified semantic representations, such as Quasi-Logical Form, Underspecified Logical Form, Underspecified Discourse Representation Theory, Minimal Recursion Semantics, Ontological Promiscuity, Hole Semantics, the Constraint Language for Lambda Structures, and Normal Dominance Constr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008